Fast Insertion-Based Optimization of Bounding Volume Hierarchies
نویسندگان
چکیده
منابع مشابه
Fast Insertion-Based Optimization of Bounding Volume Hierarchies
We present an algorithm for fast optimization of bounding volume hierarchies (BVH) for efficient ray tracing. We perform selective updates of the hierarchy driven by the cost model derived from the surface area heuristic. In each step the algorithm updates a fraction of the hierarchy nodes in order to minimize the overall hierarchy cost. The updates are realized by simple operations on the tree...
متن کاملRasterized Bounding Volume Hierarchies
We present the rasterized bounding volume hierarchy (RBVH), a compact data structure that accelerates approximate ray casting of complex meshes and provides adjustable level of detail. During construction, we identify subtrees of BVHs containing surfaces that can be represented by height fields. For these subtrees the conventional ray-surface intersection, which possibly involves a large number...
متن کاملFast Hardware Construction and Refitting of Quantized Bounding Volume Hierarchies
There is recent interest in GPU architectures designed to accelerate ray tracing, especially on mobile systems with limited memory bandwidth. A promising recent approach is to store and traverse Bounding Volume Hierarchies (BVHs) [KK86], used to accelerate ray tracing, in low arithmetic precision. However, so far there is no research on refitting or construction of such compressed BVHs, which i...
متن کاملIntroduction to bounding volume hierarchies
This paper is an excerpt from Chapter 1 of my PhD thesis [Hav04], written to introduce my publications about bounding volume hierachies [Aga02, Arg04, Hav04BG]. 1 Computational geometry and geometric data structures Computational geometry is the area of algorithms research that deals with computations on geometric objects. Examples of such objects are points, lines and polygons in the plane—whi...
متن کاملBounding Volume Hierarchies of Slab Cut Balls
We introduce a bounding volume hierarchy based on the Slab Cut Ball. This novel type of enclosing volume provides an attractive balance between tightness of fit, cost of overlap testing, and memory requirement. The hierarchy construction algorithm includes a new method for the construction of tight bounding volumes in worst case O(n) time, which means our tree data structure is constructed in O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2013
ISSN: 0167-7055
DOI: 10.1111/cgf.12000